University of Otago Technical Report OUCS - 2006 - 09 Permutations Containing Many Patterns
نویسندگان
چکیده
It is shown that the maximum number of patterns that can occur in a permutation of length n is asymptotically 2. This significantly improves a previous result of Coleman.
منابع مشابه
Department of Computer Science , University of Otago Technical Report OUCS - 2006 - 04 Monotonic Sequence
In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascending subsequence of length a or a descending one of length d. We investigate the behaviour of this game when played on finite linear orders or Q and provide some general observations for play on arbitrary ordered sets.
متن کاملUniversity of Otago Technical Report OUCS - 2010 - 04 View - Oriented Transactional Memory
—This paper proposes a View-Oriented Transac-tional Memory (VOTM) model to seamlessly integrate different concurrency control methods including locking mechanism and transactional memory. The model allows programmers to partition the shared memory into " views " which are non-overlapping sets of shared data objects. A Restricted Admission Control (RAC) scheme is proposed to control the number o...
متن کاملBiogeographical patterns of marine larval trematode parasites in two intermediate snail hosts in Europe
Species generally show recognizable large-scale biogeographical patterns in distribution and abundance (Cox & Moore, 2005; Lomolino et al., 2006). Many species exhibit similar distributions depending on similar regional conditions, a phenomenon allowing the detection of distinct faunal provinces and regions (Briggs, 1995; Cox & Moore, 2005; Lomolino et al., 2006). Whereas free-living species ha...
متن کاملHorse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations π avoiding 132 and 1223 (there is no occurrence πi < πj < πj+1 such that 1 ≤ i ≤ j − 2) and provide a combinatorial interpretation for such permutations in terms of lattice paths. ...
متن کاملAnaphora and Discourse Semantics
We argue in this paper that many common adverbial phrases generally taken to be discourse connectives signalling discourse relations between adjacent discourse units are instead anaphors. We do this by (i) demonstrating their behavioral similarity with more common anaphors (pronouns and definite NPs); (ii) presenting a general framework for understanding anaphora into which they nicely fit; (ii...
متن کامل